An Adaptive Strategy Applied to Memetic Algorithms
نویسندگان
چکیده
Memetic algorithms(MAs) represent one of the promising areas of evolutionary algorithms. However, there are many issues to be solved to design a robust MA. In this paper, we introduce an adaptive memetic algorithm, named GADEDHC, which combines a genetic algorithm and a differential evolution algorithm as global search methods with a directional hill climbing algorithm as local search method. In addition, a novel strategy is proposed to balance the intensity of global search methods and local search method, as well as the ratio between genetic algorithm and differential evolution algorithm. Experiments on several benchmark problems of diverse complexities have shown that the new approach is able to provide highly competitive results compared with other algorithms.
منابع مشابه
A Differential Evolution and Spatial Distribution based Local Search for Training Fuzzy Wavelet Neural Network
Abstract Many parameter-tuning algorithms have been proposed for training Fuzzy Wavelet Neural Networks (FWNNs). Absence of appropriate structure, convergence to local optima and low speed in learning algorithms are deficiencies of FWNNs in previous studies. In this paper, a Memetic Algorithm (MA) is introduced to train FWNN for addressing aforementioned learning lacks. Differential Evolution...
متن کاملAdaptive Imitation Scheme for Memetic Algorithms
Memetic algorithm, as a hybrid strategy, is an intelligent optimization method in problem solving. These algorithms are similar in nature to genetic algorithms as they follow evolutionary strategies, but they also incorporate a refinement phase during which they learn about the problem and search space. The efficiency of these algorithms depends on the nature and architecture of the imitation o...
متن کاملRuntime Analysis of a (1+1) Adaptive Memetic Algorithm and the Maximum Clique Problem
A memetic algorithm is an evolutionary algorithm (EA) augmented with a local search. For many applications, researchers have applied variations of memetic algorithms and have gained very positive experimental results. But the theory of these variations of memetic algorithms is still underdeveloped. This paper defines the (1+1) adaptive memetic algorithm (AMA) with a dynamic mutation probability...
متن کاملA NEW MEMETIC SWARM OPTIMIZATION FOR SPECTRAL LAYOUT DESIGN OF BRACED FRAMES
For most practical purposes, true topology optimization of a braced frame should be synchronized with its sizing. An integrated layout optimization is formulated here to simultaneously account for both member sizing and bracings’ topology in such a problem. Code-specific seismic design spectrum is applied to unify the earthquake excitation. The problem is solved for minimal structural weight un...
متن کاملA memetic algorithm with adaptive hill climbing strategy for dynamic optimization problems
Dynamic optimization problems challenge traditional evolutionary algorithms seriously since they, once converged, cannot adapt quickly to environmental changes. This paper investigates the application of memetic algorithms, a class of hybrid evolutionary algorithms, for dynamic optimization problems. An adaptive hill climbing method is proposed as the local search technique in the framework of ...
متن کامل